Comparison Between Simple Round Robin and Improved Round Robin Algorithms

The objective of this journal is to compare the efficiency between these two algorithms, simple round robin and improved algorithms. In real time systems algorithm, plays a significant role be used in embedded systems. Here we average turn around waiting time, also number context switching Improved an algorithm where if remaining burst less than allocated quantum then running process executed. Then remove currently from ready queue put it tail while will executed until finish as scheduled. This comparison proves that more efficient, with lower switching. There by increases system throughput.